Counting low degree number fields with almost prescribed successive minima

Abstract: The successive minima of an order in a degree n number field are n real numbers encoding information about the Euclidean structure of the order. How many orders in degree n number fields are there with almost prescribed successive minima, fixed Galois group, and bounded discriminant? In this talk, I will address this question for n = 3, 4, 5. The answers, appropriately interpreted, turn out to be piecewise linear functions on certain convex bodies. If time permits, I will also discuss function field analogues of this problem.

number theory

Audience: researchers in the topic

Comments: pre-talk at 1:20pm

UCSD number theory seminar

Series comments: Most talks are preceded by a pre-talk for graduate students and postdocs. The pre-talks start 40 minutes prior to the posted time (usually at 1:20pm Pacific) and last about 30 minutes.